Minimization of functions having Lipschitz continuous first partial derivatives

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Directional Derivatives of Lipschitz Functions

Let f be a Lipschitz mapping of a separable Banach space X to a Banach space Y. We observe that the set of points at which f is diierentiable in a spanning set of directions but not G^ ateaux diierentiable is-directionally porous. Since Borel-directionally porous sets, in addition to being rst category sets, are null in Aronszajn's (or, equivalently, in Gaussian) sense, we obtain an alternative...

متن کامل

Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives

This paper deals with two kinds of the one-dimensional global optimization problems over a closed finite interval: (i) the objective function f(x) satisfies the Lipschitz condition with a constant L; (ii) the first derivative of f(x) satisfies the Lipschitz condition with a constant M . In the paper, six algorithms are presented for the case (i) and six algorithms for the case (ii). In both cas...

متن کامل

Definable Smoothing of Lipschitz Continuous Functions

Let M be an o-minimal structure over the real closed field R. We prove the definable smoothing of definable Lipschitz continuous functions. In the case of Lipschitz functions of one variable we are even able to preserve the Lipschitz constant.

متن کامل

Locally Lipschitz Functions and Bornological Derivatives

We study the relationships between Gateaux, Weak Hadamard and Fréchet differentiability and their bornologies for Lipschitz and for convex functions. AMS Subject Classification. Primary: 46A17, 46G05, 58C20. Secondary: 46B20.

متن کامل

Algorithm for Minimization of Partial Boolean Functions

The paper presents a minimization algorithm for Boolean functions defined by truth tables. It treats only minterms having defined output values and is thus efficient above all in case of highly undefined functions, where the methods processing also the don't care states lose much time. The algorithm proves its full strength for functions with several hundreds of variables and several hundreds o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1966

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1966.16.1